Real-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems
نویسندگان
چکیده
This article proposes a Distributed Realtime Fault-tolerant model, priority Real-time Fault-tolerant algorithm and computational architecture of Distributed Real-time Fault-tolerant. According to this model, the problem of how to schedule a weighted Directed Acyclic Graph (DAG) in Distributed computing system for high reliability can be solved in the presence of multiprocessors faults. When some tasks in a DAG have dependence on each other, a task must be scheduled to make sure that maximum communication efficiency and high reliability can be guaranteed due to a processor failure. Firstly, this paper propose task model, communication model and reliability model for evaluating fault-tolerant performance of the system, and define the priority of a task so that a critical task is defined as one with the highest priority. To add some constrained conditions that do not influence the earliest start time of its successors in the process of scheduling task, The Distributed Realtime Fault-tolerant Scheduling Algorithm (DRFACS) targets maximizing reliability to dynamically schedule dependent, non-preemptive, non-periodic real-time tasks to improve the quality of service through scheduling in the case of arising massive resource failures. Finally, Experimental results demonstrate the feasibility of the proposed algorithm.
منابع مشابه
Real-time Fault-tolerant Scheduling in Heterogeneous Distributed Systems
∗ This work was supported by National Defense Pre-research Foundation of China. Abstract: Some works have been done in addressing real-time fault-tolerant scheduling algorithms. However, they all based on homogeneous distributed systems or multiprocessor systems, which have identical processors. This paper presents two fault-tolerant scheduling algorithms, RTFTNO and RTFTRC, for periodic real-t...
متن کاملEfficient Scheduling Algorithm with Fault-tolerance for Real-time Tasks in Distributed Systems
As real-time fault-tolerant scheduling is one of the main research areas in real-time fault-tolerant techniques, this paper proposes an efficient scheduling algorithm for BKCL(EBKCL). EBKCL can schedule the tasks with the fault-tolerant requirements(FTR) together with tasks without FTR. It is assumed in BKCL that there are no overlaps between the backup copies, however, the backup copies are al...
متن کاملImproving the palbimm scheduling algorithm for fault tolerance in cloud computing
Cloud computing is the latest technology that involves distributed computation over the Internet. It meets the needs of users through sharing resources and using virtual technology. The workflow user applications refer to a set of tasks to be processed within the cloud environment. Scheduling algorithms have a lot to do with the efficiency of cloud computing environments through selection of su...
متن کاملA Fault-tolerant Real-time Scheduling Algorithm for Precedence-Constrained Tasks in Distributed Heterogeneous Systems
متن کامل
Fault-Tolerant Static Scheduling for Real-Time Distributed Embedded Systems
We present in this paper a heuristic for producing automatically a distributed fault-tolerant schedule of a given data-flow algorithm onto a given distributed architecture. The faults considered are processor failures, with a failsilent behavior. Fault-tolerance is achieved with the software redundancy of computations and the time redundancy of data-dependencies.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JDIM
دوره 10 شماره
صفحات -
تاریخ انتشار 2012